Universal Estimation of Directed Information
نویسندگان
چکیده
منابع مشابه
k-NN Estimation of Directed Information
This report studies data-driven estimation of the directed information (DI) measure between twoem discrete-time and continuous-amplitude random process, based on the k-nearest-neighbors (k-NN) estimation framework. Detailed derivations of two k-NN estimators are provided. The two estimators differ in the metric based on which the nearest-neighbors are found. To facilitate the estimation of the ...
متن کاملk-NN Estimation of Directed Information
Detection and estimation of causality relationships between two random processes is a fundamental problem in many natural and social sciences [1]. This task is in particular challenging as in many real-life scenarios one does not have a good underlying statistical model for the considered process, e.g., in the fields of neuroscience, financial markets, meteorology, etc. For such scenarios it is...
متن کاملUniversal coding, information, prediction, and estimation
A connection between universal codes and the problems of prediction and statistical estimation is established. A‘known lower bound for the mean length of universal codes is sharpened and generalized, and optimum universal codes constructed. The bound is defined to give the information in strings relative to the considered class of processes. The earlier derived minimum description length criter...
متن کاملUniversal Estimation of Information Measures for Analog Sources
This monograph presents an overview of universal estimation of information measures for continuous-alphabet sources. Special attention is given to the estimation of mutual information and divergence based on independent and identically distributed (i.i.d.) data. Plug-in methods, partitioning-based algorithms, nearest-neighbor algorithms as well as other approaches are reviewed, with particular ...
متن کاملUniversal Operator Algebras of Directed Graphs
Given a directed graph, there exists a universal operator algebra and universal C∗-algebra associated to the directed graph. For finite graphs this algebra decomposes as the universal free product of some building block operator algebras. For countable directed graphs, the universal operator algebras arise as direct limits of operator algebras of finite subgraphs. Finally, a method for computin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2013.2267934